On the Capacity-Achieving Input of Channels With Phase Quantization

نویسندگان

چکیده

Several information-theoretic studies on channels with output quantization have identified the capacity-achieving input distributions for different fading 1-bit in-phase and quadrature (I/Q) quantization. However, an exact characterization of distribution multi-bit phase has not been provided. In this paper, we consider four channel models at identify optimal each model. We first a complex Gaussian $b$-bit phase-quantized prove that is rotated $2^b$-phase shift keying (PSK). The analysis then extended to multiple scenarios. show optimality $2^b$-PSK continues hold under noncoherent fast Rician when line-of-sight (LoS) present. When state information (CSI) available receiver, $\frac{2\pi}{2^b}$-symmetry constant amplitude as necessary sufficient conditions ergodic distribution; which satisfies. Finally, optimum power control scheme presented achieves capacity CSI also transmitter.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacity-achieving Input Covariance for Correlated Multi-Antenna Channels

Abstract This paper characterizes the capacity-achieving input covariance for multiantenna channels with (zero-mean) arbitrary distribution. The solution accommodates a wide range of correlation structures, not necessarily separate transmitreceive. Our characterization of the covariance encompasses both its eigenvectors, which are found explicitly, and its eigenvalues, for which we present nece...

متن کامل

Summary on Capacity Achieving Probability Measure of an Input-Constrained Vector Gaussian Channels

In this summary, the additive Gaussian noise channel subject to two types of constraints: (1) physical channel constraints, and (2) first-order cost constraints is considered. This channel is shown to have a unique capacity achieving input distribution, which is “discrete” in nature. A necessary and sufficient condition for the capacity achieving distribution is also derived. December 22, 2002 ...

متن کامل

Capacity-Achieving Codes with Bounded Graphical Complexity on Noisy Channels

We introduce a new family of concatenated codes with an outer low-density parity-check (LDPC) code and an inner low-density generator matrix (LDGM) code, and prove that these codes can achieve capacity under any memoryless binaryinput output-symmetric (MBIOS) channel using maximum-likelihood (ML) decoding with bounded graphical complexity, i.e., the number of edges per information bit in their ...

متن کامل

Generalized Bounds on the Capacity of the Binary-Input Channels

We provide improved bounds on the symmetric capacity of the binary channnels in terms of their Bhattacharyya parameters.

متن کامل

On the capacity of multiple input erasure relay channels

In this paper we consider a network that consists of two senders and two receivers. We further assume that each sender could act as a relay for other communications. The channel connecting these nodes is supposed to be an erasure channel where symbols are received correctly without any error, or lost. This setting could be used to analyze the capacity of a realistic Ad-hoc network. From the net...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2022

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2022.3174557